Approximate partitioning of 2D objects into orthogonally convex components
Identifieur interne : 001728 ( Main/Exploration ); précédent : 001727; suivant : 001729Approximate partitioning of 2D objects into orthogonally convex components
Auteurs : Mousumi Dutt [Inde] ; Arindam Biswas [Inde] ; Partha Bhowmick [Inde]Source :
- Computer vision and image understanding : (Print) [ 1077-3142 ] ; 2013.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
A fast and efficient algorithm to obtain an orthogonally convex decomposition of a digital object is presented. The algorithm reports a sub-optimal solution and runs in O(n log n) time for a hole-free object whose boundary consists of n pixels. The decomposition algorithm can, in fact, be applied on any hole-free orthogonal polygon; in our work, it is applied on the inner isothetic cover of the concerned digital object. The approximate/rough decomposition of the object is achieved by partitioning the inner cover (an orthogonal polygon) of the object into a set of orthogonal convex components. A set of rules is formulated based on the combinatorial cases and the decomposition is obtained by applying these rules while considering the concavities of the inner cover. The rule formulation is based on certain theoretical properties apropos the arrangement of concavities, which are also explained in this paper. Experimental results on different shapes have been presented to demonstrate the efficacy, elegance, and robustness of the proposed technique.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000073
- to stream PascalFrancis, to step Curation: 000934
- to stream PascalFrancis, to step Checkpoint: 000075
- to stream Main, to step Merge: 001746
- to stream Main, to step Curation: 001728
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Approximate partitioning of 2D objects into orthogonally convex components</title><author><name sortKey="Dutt, Mousumi" sort="Dutt, Mousumi" uniqKey="Dutt M" first="Mousumi" last="Dutt">Mousumi Dutt</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Information Technology, Bengal Engineering and Science University</s1><s2>Shibpur, Howrah</s2><s3>IND</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Inde</country><wicri:noRegion>Shibpur, Howrah</wicri:noRegion></affiliation></author><author><name sortKey="Biswas, Arindam" sort="Biswas, Arindam" uniqKey="Biswas A" first="Arindam" last="Biswas">Arindam Biswas</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Information Technology, Bengal Engineering and Science University</s1><s2>Shibpur, Howrah</s2><s3>IND</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Inde</country><wicri:noRegion>Shibpur, Howrah</wicri:noRegion></affiliation></author><author><name sortKey="Bhowmick, Partha" sort="Bhowmick, Partha" uniqKey="Bhowmick P" first="Partha" last="Bhowmick">Partha Bhowmick</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Computer Science and Engineering, Indian Institute of Technology</s1><s2>Kharagpur</s2><s3>IND</s3><sZ>3 aut.</sZ></inist:fA14><country>Inde</country><wicri:noRegion>Kharagpur</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">13-0182238</idno><date when="2013">2013</date><idno type="stanalyst">PASCAL 13-0182238 INIST</idno><idno type="RBID">Pascal:13-0182238</idno><idno type="wicri:Area/PascalFrancis/Corpus">000073</idno><idno type="wicri:Area/PascalFrancis/Curation">000934</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000075</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000075</idno><idno type="wicri:doubleKey">1077-3142:2013:Dutt M:approximate:partitioning:of</idno><idno type="wicri:Area/Main/Merge">001746</idno><idno type="wicri:Area/Main/Curation">001728</idno><idno type="wicri:Area/Main/Exploration">001728</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Approximate partitioning of 2D objects into orthogonally convex components</title><author><name sortKey="Dutt, Mousumi" sort="Dutt, Mousumi" uniqKey="Dutt M" first="Mousumi" last="Dutt">Mousumi Dutt</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Information Technology, Bengal Engineering and Science University</s1><s2>Shibpur, Howrah</s2><s3>IND</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Inde</country><wicri:noRegion>Shibpur, Howrah</wicri:noRegion></affiliation></author><author><name sortKey="Biswas, Arindam" sort="Biswas, Arindam" uniqKey="Biswas A" first="Arindam" last="Biswas">Arindam Biswas</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Department of Information Technology, Bengal Engineering and Science University</s1><s2>Shibpur, Howrah</s2><s3>IND</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>Inde</country><wicri:noRegion>Shibpur, Howrah</wicri:noRegion></affiliation></author><author><name sortKey="Bhowmick, Partha" sort="Bhowmick, Partha" uniqKey="Bhowmick P" first="Partha" last="Bhowmick">Partha Bhowmick</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Department of Computer Science and Engineering, Indian Institute of Technology</s1><s2>Kharagpur</s2><s3>IND</s3><sZ>3 aut.</sZ></inist:fA14><country>Inde</country><wicri:noRegion>Kharagpur</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Computer vision and image understanding : (Print)</title><title level="j" type="abbreviated">Comput. vis. image underst. : (Print)</title><idno type="ISSN">1077-3142</idno><imprint><date when="2013">2013</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Computer vision and image understanding : (Print)</title><title level="j" type="abbreviated">Comput. vis. image underst. : (Print)</title><idno type="ISSN">1077-3142</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Computer vision</term><term>Convex set</term><term>Experimental result</term><term>Expert system</term><term>Fast algorithm</term><term>Free boundary</term><term>Image analysis</term><term>Image processing</term><term>Morphological analysis</term><term>Optimal solution</term><term>Polygon</term><term>Robustness</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Vision ordinateur</term><term>Solution optimale</term><term>Polygone</term><term>Système expert</term><term>Analyse image</term><term>Traitement image</term><term>Limite libre</term><term>Analyse morphologique</term><term>Algorithme rapide</term><term>Ensemble convexe</term><term>Résultat expérimental</term><term>Robustesse</term><term>.</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">A fast and efficient algorithm to obtain an orthogonally convex decomposition of a digital object is presented. The algorithm reports a sub-optimal solution and runs in O(n log n) time for a hole-free object whose boundary consists of n pixels. The decomposition algorithm can, in fact, be applied on any hole-free orthogonal polygon; in our work, it is applied on the inner isothetic cover of the concerned digital object. The approximate/rough decomposition of the object is achieved by partitioning the inner cover (an orthogonal polygon) of the object into a set of orthogonal convex components. A set of rules is formulated based on the combinatorial cases and the decomposition is obtained by applying these rules while considering the concavities of the inner cover. The rule formulation is based on certain theoretical properties apropos the arrangement of concavities, which are also explained in this paper. Experimental results on different shapes have been presented to demonstrate the efficacy, elegance, and robustness of the proposed technique.</div></front></TEI><affiliations><list><country><li>Inde</li></country></list><tree><country name="Inde"><noRegion><name sortKey="Dutt, Mousumi" sort="Dutt, Mousumi" uniqKey="Dutt M" first="Mousumi" last="Dutt">Mousumi Dutt</name></noRegion><name sortKey="Bhowmick, Partha" sort="Bhowmick, Partha" uniqKey="Bhowmick P" first="Partha" last="Bhowmick">Partha Bhowmick</name><name sortKey="Biswas, Arindam" sort="Biswas, Arindam" uniqKey="Biswas A" first="Arindam" last="Biswas">Arindam Biswas</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001728 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001728 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:13-0182238
|texte= Approximate partitioning of 2D objects into orthogonally convex components
}}
| This area was generated with Dilib version V0.6.33. |  |